منابع مشابه
Learning Parallel Systems by Regular Trace Languages
We study the problem of learning by examples the structure of regular trace languages, a useful formalization of systems or programs of concurrent operations. Negative results are showed about traces with empty and total concurrency, and we compare them with a positive result derived from a work by N. Abe, about trace languages generated by commutative regular languages.
متن کاملIdentifying Regular Languages over Partially-Commutative Monoids
We deene a new technique useful in identifying a subclass of regular languages deened on a free partially commutative monoid (regular trace languages), using equivalence and membership queries. Our algorithm extends an algorithm deened by Dana Angluin in 1987 to learn DFA's. The words of a trace language can be seen as equivalence classes of strings. We show how to extract, from a given equival...
متن کاملOn the expressiveness of spider diagrams and commutative star-free regular languages
Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are equivalent in expressive power to monadic first-order logic with equality, MFOL[1⁄4]. languages that are finite unions of languages of the form K G , ...
متن کاملCommutative Languages and their Composition by Consensual Methods
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time NLOG-SPACE multi-counter machines. We show that unions and concatenations of such languages can be similarly recognized, relying on – and further developing, our recent results on the family of consensually regular (CREG) languages. A CREG language is defined by a regular language on the alphabet ...
متن کاملDefining star-free regular languages using diagrammatic logic
Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and their cardinalities. By contrast, the study of regular languages is one of the oldest active branches of computer science research. The work in this thesis examines the previously unstudied relationship between spider diagrams and regular languages. In this thesis, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008